Connected domination and dominating clique in trapezoid graphs
نویسندگان
چکیده
منابع مشابه
Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs
A graph is distance-hereditary if the distance between any two vertices in a connected induced subgraph is the same as in the original graph. This paper presents e-cient algorithms for solving the weighted connected k-domination and the weighted k-dominating clique problems in distance-hereditary graphs. c © 2001 Elsevier Science B.V. All rights reserved.
متن کاملGeneralized connected domination in graphs
As a generalization of connected domination in a graph G we consider domination by sets having at most k components. The order γ c (G) of such a smallest set we relate to γc(G), the order of a smallest connected dominating set. For a tree T we give bounds on γ c (T ) in terms of minimum valency and diameter. For trees the inequality γ c (T ) ≤ n− k − 1 is known to hold, we determine the class o...
متن کاملConnected domination of regular graphs
A dominating set D of a graph G is a subset of V (G) such that for every vertex v ∈ V (G), either v ∈ D or there exists a vertex u ∈ D that is adjacent to v in G. Dominating sets of small cardinality are of interest. A connected dominating set C of a graph G is a dominating set of G such that the subgraph induced by the vertices of C in G is connected. A weakly-connected dominating set W of a g...
متن کاملConnected odd dominating sets in graphs
An odd dominating set of a simple, undirected graph G = (V,E) is a set of vertices D ⊆ V such that |N [v]∩D| ≡ 1 mod 2 for all vertices v ∈ V . It is known that every graph has an odd dominating set. In this paper we consider the concept of connected odd dominating sets. We prove that the problem of deciding if a graph has a connected odd dominating set is NP-complete. We also determine the exi...
متن کاملOn graphs with equal total domination and connected domination numbers
A subset S of V is called a total dominating set if every vertex in V is adjacent to some vertex in S. The total domination number γt (G) of G is the minimum cardinality taken over all total dominating sets of G. A dominating set is called a connected dominating set if the induced subgraph 〈S〉 is connected. The connected domination number γc(G) of G is the minimum cardinality taken over all min...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2000
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(99)00127-4